BDD Path Length Minimization Based on Initial Variable Ordering
نویسندگان
چکیده
منابع مشابه
BDD Path Length Minimization Based on Initial Variable Ordering
A large variety of problems in digital system design, combinational optimization and verification can be formulated in terms of operations performed on Boolean functions. The time complexity of Binary Decision Diagram (BDD) representing a Boolean function is directly related to the path length of that BDD. In this paper we present a method to generate a BDD with minimum path length. The Average...
متن کاملDesign of Experiments in BDD Variable Ordering
Design of Experiments in BDD Variable Ordering: Lessons Learned Justin E. Harlow III1 Franc Brglez2 1Dept. of Electrical & Computer Engineering, Duke University, Durham, NC 27708 2CBL (Collaborative Benchmarking Lab), Dept. of Comp. Science, Box 7550, NC State U., Raleigh, NC 27695 http://www.cbl.ncsu.edu/ Abstract { Applying the Design of Experiments methodology to the evaluation of BDD variab...
متن کاملMinimization of Average Path Length in BDDs by Variable Reordering
Minimizing the Average Path Length (APL) in a BDD reduces the time needed to evaluate Boolean functions represented by BDDs. This paper describes an efficient heuristic APL minimization procedure based on BDD variable reordering. The reordering algorithm is similar to classical variable sifting with the cost function equal to the APL rather than the number of BDD nodes. The main contribution of...
متن کاملVariable Length Path Branch Prediction Variable Length Path Branch Prediction
all of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for proot or commercial advantage and that copies bear this notice and the full citation on the rst page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, to republish, to post on servers, ...
متن کاملImproving BDD Variable Ordering Using Abstract BDDs and Sampling
Variable ordering for BDDs has been extensively investigated. Recently, sampling based ordering techniques have been proposed to overcome problems with structure based static ordering methods and sifting based dynamic reordering techniques. However, existing sampling techniques can lead to an unacceptably large deviation in the size of the final BDD. In this paper, we propose a sampling techniq...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer Science
سال: 2005
ISSN: 1549-3636
DOI: 10.3844/jcssp.2005.521.529